Towards Hamming Processor
نویسندگان
چکیده
Given Hamming coded or systematic Bose–Chaudhuri-Hocquenghem (BCH) or Reed-Solomon correctable operands x and y and an operation op , we present arithmetic to compute the operation Correct( x )opCorrect(y) while preserving the correct-ability of the result. If the Hamming distance of x(y) from Correct(x) (Correct(y)) is dx (dy, respectively) and the maximal correctable distance is dc then our implementation can withstand dc − ( dx + dy) faulty gates. We also present a slightly more expensive implementation which corrects the inputs when no faulty gates exist. In contrast to traditional Hamming code-based approaches to operational block protection, we protect the operation themselves rather than only the registers of input/output data.
منابع مشابه
Simulation of Hamming Coding and Decoding for Microcontroller Radiation Hardening
This paper presents a method of hardening the 8051 micro-controller, able to assure reliable operation in the presence of bit flips caused by radiation. Aiming at avoiding such faults in the 8051 micro-controller, Hamming code protection was used in its SRAM memory and registers. A VHDL code has been used for this hamming code protection. Keywords—Radiation, hardening, bitflip, hamming code.
متن کاملSubset Encoding: Increasing Pattern Density for Finite Automata
Micron’s Automata Processor is an innovative reconfigurable hardware accelerator for parallel finite-automatabased regular-expression matching. While the Automata Processor has demonstrated potential for many pattern matching applications, other applications receive reduced benefit from the architecture due to capacity limitations or routing limitations. In this paper, we present an efficient i...
متن کاملLow Power Realization of FIR Filters Using Optimization Techniques
In this paper an algorithm for optimizing coefficients of a Finite Impulse Response (FIR) filter, so as to reduce power dissipation of its implementation on a programmable Digital Signal Processor is presented. We then present an algorithm that optimizes coefficients so as to minimize the Hamming distance and signal toggling. Two such techniques „Steepest descent‟ and „Genetic Algorithm‟ are pr...
متن کاملTransmitting in the n-Dimensional Cube
Alon, N., Transmitting in the n-dimensional cube, Discrete Applied Mathematics 37/38 (1992) 9-1 I. Motivated by a certain communication problem we show that for any integer n and for any sequence (a,,...,ak) of k = [n/21 binary vectors of length n, there is a binary vector z of length n whose Hamming distance from a, is strictly bigger than k-i for all 1 5 i 5 k. The n-dimensional cube is the g...
متن کاملSide Channel Cryptanalysis of Product Ciphers
Building on the work of Kocher [Koc96], we introduce the notion of side-channel cryptanalysis: cryptanalysis using implementation data. We discuss the notion of side-channel attacks and the vulnerabilities they introduce, demonstrate side-channel attacks against three product ciphers—timing attack against IDEA, processor-flag attack against RC5, and Hamming weight attack against DES—and then ge...
متن کامل